Method and apparatus for time-sliced and multi-threaded data processing in a communication system

ABSTRACT

A method for designing a time-sliced and multi-threaded architecture comprises the steps of conducting a thorough analysis of a range of applications and building a specific processor to accommodate the range of applications. In one embodiment, the thorough analysis includes extracting real time aspects from each application, determining optimal granularity in the architecture based on the real time aspects of each application, and adjusting the optimal granularity based on acceptable context switching overhead.

PRIORITY INFORMATION

This application claims priority from the Provisional Application entitled “Apparatus and Method for Despreading Data in a CDMA System”, U.S. Ser. No. 60/222,007, filed on Jul. 31, 2000.

CROSS REFERENCE TO RELATED APPLICATION

Related applications are:

“Generic Finger Architecture for Spread Spectrum Applications”, filed concurrently herewith;

“Apparatus and Methods for Sample Selection and Reuse of Rake Fingers in Spread Spectrum Systems”, filed concurrently herewith; and

“Apparatus and Method for Configurable Multi-dwell Search Engine for Spread Spectrum Applications”, filed concurrently herewith.

Each of these applications is incorporated herein by reference.

BACKGROUND OF THE INVENTION

This invention relates generally to wireless communication systems.

Wireless communication has extensive applications in consumer and business markets. Among the many communication applications/systems are: mobile wireless, fixed wireless, unlicensed Federal Communications Commission (FCC) wireless, local area network (LAN), cordless telephony, personal base station, telemetry, and others.

Signal processing protocols and standards have proliferated with advances in wireless communications devices and services. Current communications protocols include Frequency Division Multiplexing (FDM), Time Division Multiple Access (TDMA), and Code Division Multiple Access (CDMA). The United States, Europe, Japan, and Korea have all developed their own standards for each communications protocol. TDMA standards include Interim Standard-136 (IS-136), Global System for Mobile (GSM), and General Packet Radio Service (GPRS). CDMA standards include Global Positioning System (GPS), Interim Standard-95 (IS-95) and Wide Band CDMA (WCDMA). Wireless communications services include paging, voice and data applications.

In many cases, within the same field of applications, different systems use incompatible modulation techniques and protocols. Consequently, each system may require unique hardware, software, and methodologies for baseband processing. This practice can be costly in terms of design, testing, manufacturing, and infrastructure resources. As a result, a need arises to overcome the limitations associated with the varied hardware, software, and methodology of processing digital signals in each of the varied applications.

Until recently, individual wireless communications devices supported a single communications standard. In theory, however, a wireless communications device can be designed using a general purpose Digital Signal Processor (DSP) that is programmed first to realize a first set of functional blocks specifying the minimum performance requirements for a first application and can be reprogrammed to realize a second set of functional blocks to provide a second application. To achieve these minimum performance requirements, system designers design algorithms (sequences of arithmetic, trigonometric, logic, control, memory access, indexing operations, and the like) to encode, transmit, and decode signals. These algorithms are typically specified in software. The set of algorithms which achieve the target performance specification is collectively referred to as the executable specification. This executable specification can then be compiled and run on the DSP, typically via the use of a compiler. Despite the increasing computational power and speed of general purpose DSPs and decreasing memory cost and size, designers have not been able to satisfy cost, power and speed requirements simply by programming a general purpose DSP with the executable specification for a standard-specific application.

Additional dedicated high-speed processing is required, a need which has traditionally been met using an application-specific processor. As used herein, an application-specific processor is a processor that excels in the efficient execution (power, area, flexibility) of a set of algorithms tailored to the application. An application-specific processor, however, fares extremely poorly for algorithms outside the intended application space. In other words, the improved speed and power efficiency of application-specific-processors comes at the cost of function flexibility.

Demand is now growing for wireless communications devices that support multiple applications and varying grades of services over multiple standards. In particular, demand is growing for cellular handsets, which are one type of wireless communications device, to support multiple applications and services over multiple standards. Today's solution to this problem is to essentially connect multiple application-specific processors together to obtain multi-standard operation, thereby adding cost in terms of design resources, design time, and silicon area.

Cellular handsets and basestations, including PCS (Personal Communications Services) and 3-G (Third Generation) devices, need to acquire certain cell specific information and characteristics before negotiating a service with a base station. For this purpose, each base station transmits certain cell specific information necessary for a user to acquire services such as paging or cellular telephony from the base station. For example, in CDMA based systems, the cell specific information is contained in pilot and/or synchronization channels. The pilot and/or synchronization channels are spread and scrambled with cell specific pseudo-random noise (PN) or gold code sequences. At the receiver, the scrambled sequence is converted back to the original data sequence.

Multiple users are typically served at a single base station. In CDMA systems, each user is assigned an orthogonal code from a set of orthogonal codes and data that is transmitted from the base station to the user is spread according to the assigned orthogonal code. Even though users operate on the same frequency at the same time, the use of orthogonal codes allow multiple users to be distinguished from one another.

Some data processing systems employ a generic time-sliced architecture to perform data processing functions. Typically, a user builds an application on top of a generic time-sliced architecture based on fixed constraints inherent in the generic time-sliced architecture. For example, data processing engines are designed to optimize the performance on the silicon process for a generic set of operations. When using a generic time-sliced architecture, a user designing an application has the responsibility of real time scheduling (e.g., reading and writing to and from memory) on the generic time sliced architecture. This responsibility is particularly burdensome if a high volume of data comes in at a very high speed, such as data arriving in wireless communications. In addition, even if a user is able to write applications that successfully schedule real time processes, the user still has the burden of managing and maintaining real time aspects of the processing at the lowest level (i.e., below radio frame).

In view of the foregoing, it is desirable to provide a specific processor that supports disparate communications and signal processing standards in a cost, area, and power efficient fashion. It is further desirable to provide a method and apparatus that automates time scheduling aspects of data processing by optimizing a specific time-sliced and multi-threaded architecture in a communication system.

SUMMARY OF THE INVENTION

This invention provides processor architectures that enable high throughput chip rate processing. In an exemplary embodiment, parallel processing techniques and control structures are used to provide flexibility in managing buffer and processing requirements of high performance spread spectrum systems. An architecture in accordance with an exemplary embodiment provides optimization of buffer and processing requirements in a highly flexible micro-architectural implementation. Advantages of implementing the micro-architectures in accordance with embodiments of this invention include: (1) maximizing the efficiency of processing by scaling throughput relative to input data rate; (2) increasing flexibility across a wide range of searching/tracking configurations; (3) improving scalability across variable data rates associated with users; (4) providing software control of finger scheduling to accommodate varying requirements; and (5) providing search control flexibility.

In an exemplary embodiment, a time-sliced and multi-threaded architecture is designed by conducting a thorough analysis of a range of applications and building a specific processor to accommodate the range of applications. In one embodiment, the thorough analysis includes extracting real time aspects from each application, determining optimal granularity in the architecture based on the real time aspects of each application, and adjusting the optimal granularity based on acceptable context switching overhead.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of an exemplary multi-threaded architecture for spread spectrum chip rate processing in accordance with an embodiment of the invention.

FIG. 2 is a flow chart of an optimal architecture implementation process in accordance with an embodiment of the invention.

DETAILED DESCRIPTION OF THE INVENTION

FIG. 1 illustrates a basic multi-threaded micro-architecture 100 in accordance with an exemplary embodiment of the invention. The multi-threaded micro-architecture 100 can be leveraged across numerous multi-user spread spectrum receiver applications. The multi-threaded micro-architecture 100 includes a data cache 102, a first finger processing element 104, a second finger processing element 106, an “nth” (where “n” represents an arbitrary, configurable number) finger processing element 108, and a master control unit 110. The master control unit includes a time slot table 112 and a partial sums search table 114. In an exemplary embodiment, the number of finger processing elements in the architecture 100 is dependent on various design constraints and can vary from architecture to architecture without departing from the essence of this invention. For ease of explanation, three finger processing elements 104, 106, 108 are illustrated in FIG. 1. Each finger processing element includes a secondary cache 122, a data selection module 124, a despread/dechannelize datapath 126, and a symbol integration module 128.

Incoming digital data, which contains code modulated user information, is buffered in the data cache 102. The data cache 102 is shared by all finger processing elements 104-108. Each finger processing element 104-108 contains the necessary datapath for despreading, dechannelization, and symbol integration of the individual user channels. The master control unit 110 allocates time slots, maintains synchronization of the finger processing elements 104-108, and maximizes throughput. For example, the partial sums search table 114 is allocated on a per searcher basis to extend search control flexibility across time slots. In an exemplary embodiment, the master control unit 110 is linked to an external processing element to manage time slot allocation among finger processing elements 104-108.

In an exemplary embodiment, the data cache 102 is a parallel port memory that is configured to enable multi-threaded access at virtually the same time. In one embodiment, a hierarchical caching structure is implemented where the data cache 102 includes a primary cache that is accessible by each finger processing element 104-108 in a round-robin manner. Each finger processing element 104-108 includes a secondary cache that is configured to prefetch data from the primary cache and store such prefetched data. For example, if there are 16 finger processing elements, the first finger processing element 104, during its turn to access the primary cache, prefetches 16 samples, such that it has 16 clock cycles of time before it needs to prefetch again. Similarly, during the next clock cycle, the second finger processing element 106 prefetches 16 samples and so on. This way, the data cache 102 can be built as a multi-ported RAM (e.g., 16-ported) at very low cost. Further details on caching systems are disclosed in the above-referenced, concurrently filed application entitled “Generic Finger Architecture for Spread Spectrum Applications”.

The processor architectures in accordance with various embodiments of the present invention use a common processing element (e.g., finger processing elements 104-108) to support varying spreading factors, modulation schemes, and user data rates. Furthermore, the processor architecture enables flexible searching algorithms with variable length search windows, which are made possible in part by a shared search table and a master control. In addition, multiple data stream selection, such as varying antenna configuration, can be used to further reduce silicon costs for manufacturing the finger processing elements. Further details on appropriate processor architecture are disclosed in the above-referenced, concurrently filed application entitled: “Apparatus and Methods for Sample Selection and Reuse of Rake Fingers in Spread Spectrum Systems.”

In one embodiment, the multi-threaded micro-architecture 100 is a hardware computation resource that can be applied to a single computation process (e.g., a multipath of a given channel). In another embodiment, the computation resource provided by the multi-threaded micro-architecture 100 can be enhanced by running the multi-threaded micro-architecture 100 at a clock rate higher than that required by a process (e.g., higher than the data rate for a communication protocol). In this manner, resources of individual computation components, such as the multi-threaded micro-architecture 100, can be time-shared across multiple computation processes (e.g., several multipaths and/or multiple channels). Additional information on the design and implementation of configurations into a configurable communication device is provided in a co-pending application bearing Ser. No. 09/492,634, entitled “Improved Apparatus and Method for Multi-Threaded Signal Processing.” This application is commonly assigned and is hereby incorporated for all purposes.

FIG. 2 illustrates an exemplary process for designing an optimal time-sliced and multi-threaded architecture. At step 202, symbol processing requirements are determined. In an exemplary embodiment, a microprocessor workstation receives inputs of a range of applications to be supported by the architecture being designed.

The process of determining an optimal component combination that maximizes the efficiency of the multi-threaded chip rate processor involves consideration of various system requirements. In an exemplary embodiment, system requirements include: (1) possible antenna configurations, incoming data rates, and combining requirements; (2) downstream processing requirements that dictate output symbol rate requirements; (3) processor interface requirements that impact the efficient allocation of finger processing elements; (4) variations in the spreading/modulation processes that are applied to the expected data streams; and (5) environmental requirements, such as search time, simultaneous multi-path tracking, and peak/average channel capacity requirements. In an exemplary embodiment, after consideration of system requirements, including the ones listed above, key architecture aspects can be determined. Examples of the key aspects include: data cache memory requirements, number of finger processing elements, performance requirements of the finger processing elements, performance constraints of the finger processing elements, memory bandwidth requirements of the data cache, and time slot size to accommodate convenient downstream processing.

In an exemplary embodiment, fundamental processing units are defined by applying a profiling process. The fundamental processing units are parameterizable processing blocks that may be application specific but can be enabled for a variety of protocols. The profiling process is performed from a system and hardware perspective to optimize time sliced and multi-threaded architecture. Illustrative examples of fundamental processing units are the hardware kernels described in FIG. 2 of co-pending U.S. application Ser. No. 09/772,584 entitled “A Wireless Spread Spectrum Communication Platform Using Dynamically Reconfigurable Logic.” Additional information on the profiling process is provided in co-pending U.S. application Ser. No. 09/565,654, entitled “Method of Profiling Disparate Communications and Signal Processing Standards and Services.” These applications are commonly assigned and are hereby incorporated by reference for all purposes.

During profiling, a determination is made of the lowest level of timing granularity needed. In digital signal processing the fundamental time unit is ordinarily the over-sampling rate of the originally transmitted signal which typically is the Nyquest rate. In a typical spread spectrum system, the fundamental unit of time is the chip rate. The fineness of a desired granularity is determined by profiling the types of processing required for each application. Further, in determining granularity, a trade off between fine granularity and high context switching overhead should be considered. In general, the finer the granularity, the better the algorithmic performance. But at the same time, the finer the granularity, the more context switching is required in hardware. In a preferred embodiment, the granularity should be fine enough that the targeted algorithms perform signal processing efficiently while allowing a given process of the targeted algorithms to run in the processor for as long as possible, thus, minimizing context switching overhead.

In an exemplary embodiment, the time-sliced architecture in accordance with the invention is capable of supporting multiple spread spectrum applications that run at different granularities when optimized. For example, a first application may be optimized at 8× chip rate granularity while a second application may be optimized at 1× chip rate granularity.

In another exemplary embodiment, the time-sliced architecture is able to call programming across different protocols in a given application space. In contrast to prior art architectures where the overall concern is regarding hardware resource utilization at a known and fixed performance level, the architecture in accordance with embodiments of this invention is not only application specific (for a set of applications) but also flexibly reconfigurable to support multiple applications. In one embodiment, the present architecture enables speed grading (i.e., sorting and assembly of components into useable devices in accordance with their demonstrated operating speed instead rejection of components for failure to meet a specified operating speed) to control available flexibility. That is, the architecture can be configured into different channel densities depending on the number of logical processors it supports for each application.

At step 204, the target silicon processes needed to achieve the fundamental processing units defined in the previous step (i.e., profiling) are determined. That is, actual physical parts that are capable of delivering each type of processes are determined. For example, most communication operations are linear, so adder and multiplier processing units are frequently required. Thus, during this step, for a given application, the physical location of each necessary adder and/or multiplier (as well as the physical locations of other processing units) on silicon is determined based on data control flow and input/output location.

At step 206, the input and output data rates are determined for each application. In an exemplary embodiment, the input data rate is calculated on a data-samples-per-second-provided-at-input basis. Output are determined by the worst case minimum rate reduction that occurs in the signal processing path.

At step 208, the size of the data cache 102 is determined. The appropriate size for data cache 102 for a spread spectrum application is determined based on balancing a trade-off between the size of the implementation (in terms of actual die size) and the delay spread that is associated with the mobile terminals or handsets. Typically, all mobile terminals in the spread spectrum system are operating in the same frequency range. Thus, the data cache 102 should be able to support two or more mobile terminals simultaneously at any given time. In an exemplary embodiment, a parallel port memory is used as the data cache 102 and a hierarchical caching structure that allows multiple threads to access the same data at the same time is implemented. In the hierarchical caching structure, a secondary cache associated with each processing thread prefetches data from a primary cache for that processing thread.

At step 210, a sensitivity analysis is performed. That is, varied combinations of time slot sizes and processing threads are checked for an optimized combination. For example, the optimal trade-off between context switching overhead and the size of the processing granularity is determined. In an exemplary embodiment, varying time slot sizes, finger processing element numbers, and independent data cache read ports are tested. The optimal number and size are determined in accordance with optimizing the complexity of silicon, including size, and channel capacity requirements.

Variability in time scheduling is determined based on basic time units. In other words, once basic time units have been determined, then variability in scheduling (e.g., timing of the occurrence of certain processes, number of each process per algorithm, etc.) for each algorithm is determined. For example, a given logic algorithm may require use of multiple processing threads. Thus, an optimal trade-off between the number of logic algorithms running on the system and the amount of time needed to run each algorithm should be determined in view of the overall goal of maximizing channel density.

In an exemplary embodiment, real time scaling can be achieved. For example, during off-peak hours, some or all logical threads may be disabled to conserve power consumption.

The foregoing examples illustrate certain exemplary embodiments of the invention from which other embodiments, variations, and modifications will be apparent to those skilled in the art. The invention should therefore not-be-limited to the particular embodiments discussed above, but rather is defined by the claims. 

1. A method for building a time-sliced architecture in a spread spectrum system, comprising the steps of: (a) analyzing a set of applications, said analyzing including the steps of: (i) extracting real time aspects from each application in said set of applications; (ii) determining an optimal granularity based on said real time aspects; and (iii) adjusting said optimal granularity based on a context switching overhead; and (b) building a specific time-sliced architecture to accommodate said range of applications based on said analyzing.
 2. The method of claim 1, wherein said extracting includes the step of: profiling fundamental processing elements in each application in said set of applications.
 3. The method of claim 1, wherein said determining includes the step of: determining a lowest level of granularity needed for each application in said set of applications.
 4. The method of claim 1, wherein said adjusting includes the step of: performing a sensitivity analysis.
 5. The method of claim 4, wherein said performing includes the step of: determining an optimal trade-off between said context switching overhead and said optimal granularity.
 6. The method of claim 1, wherein said building includes the steps of: determining a size for a data cache based on said extracting; implementing a hierarchical caching structure in said data cache; and applying said data cache in said specific time-sliced architecture.
 7. A computer program product for building a time-sliced architecture in a spread spectrum system, comprising: (a) logic code for analyzing a set of applications, said logic code for analyzing including: (i) logic code for extracting real time aspects from each application in said set of applications; (ii) logic code for determining an optimal granularity based on said real time aspects; and (iii) logic code for adjusting said optimal granularity based on a context switching overhead; and (b) logic code for building a specific time-sliced architecture to accommodate said range of applications based on said analyzing.
 8. The computer program product of claim 7, wherein said logic code for extracting includes: logic code for profiling fundamental processing elements in each application in said set of applications.
 9. The computer program product of claim 7, wherein said logic code for determining includes: logic code for determining a lowest level of granularity needed for each application in said set of applications.
 10. The computer program product of claim 7, wherein said logic code for adjusting includes: logic code for performing a sensitivity analysis.
 11. The computer program product of claim 10, wherein said logic code for performing includes: logic code for determining an optimal trade-off between said context switching overhead and said optimal granularity.
 12. The computer program product of claim 7, wherein said logic code for building includes: logic code for determining a size for a data cache based on said extracting; logic code for implementing a hierarchical caching structure in said data cache; and logic code for applying said data cache in said specific time-sliced architecture.
 13. A time-sliced processor for use in a spread spectrum system comprising: a master control unit including a time slot table and a partial sums search table; a data cache for receiving input data; and a plurality of finger processing elements, each element comprising: a cache for receiving data from the data cache, a data selector connected to an output of the cache, a despreader connected to an output of the data selector, and a symbol integrator connected to an output of the despreader. 